Arc Routing with Time-Dependent Travel Times and Paths

Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents shortest path between two locations. Studies on time-dependent followed this model and therefore defined speed functions graph. We argue that is often inadequate, particular for problems involving services edges of network. To fill gap, we formally define capacitated problem (TDCARP), with travel service given directly at level. Under these assumptions, quickest locations can change over time, leading to complex challenges capabilities current solution methods. introduce effective preprocessing paths closed form, efficient data structures time queries during optimization, heuristic exact approaches TDCARP. Our uses hybrid genetic search principle tailored solution-decoding lower bounds filtering moves. branch-and-price algorithm exploits dedicated pricing routines, dominance rules, completion find optimal solutions counting up 75 services. From algorithms, measure benefits optimization different levels travel-speed accuracy.